UNITED STATES—SOUTH AFRICA RELATION

Abstract

The article evaluates the security challenges that are likely to occur along international borders in East Africa with the advent of the East African Community Common Market in July 2010. In an attempt to illustrate the porosity of borders and the likelihood that criminals could take advantage of the situation, the author describes the ease with which transnational crime could thrive (in the absence of efficient border security measures) under the guise of informal cross-border trade that derives its basis largely from the customs and historical linkages in the region. Border towns in the region are considered zones of risk but also opportunities for quick money-making ventures and deals that tend to attract a variety of criminals. While the danger is not alarmingly high, there is a likelihood that with the opening up of the East African Community to the free movement of goods and people, criminals will exploit this freedom to commit crimes such as human trafficking, drug smuggling and moving terrorists and contraband goods unless mechanisms are put in place to curtail these activities. Should this not happen, the mission of the East African Community could be jeopardised.     

Aligning national “logics” in a European military helicopter program

This article analyzes the public side of the NH90 network consisting of four participating countries (Germany, France, Italy, and the Netherlands) and their industrial partners. Comparable to observations in earlier international projects in the defense sector, the development and production of the NH90 defense helicopter did not match original plans and costs estimates. On the basis of four mechanisms that were intended to facilitate the cooperation between the partnering countries (the General Memorandum of Understanding; coalition formation; the role of the central agency; and the process of vertical escalation) the question is posed whether or not there was a true alignment of national interests and “logics.” The lack of standardization, as well as program delays and issues concerning the division of the work-share, lead to the emerging alignment being characterized as “quasi-alignment” at best.     

Determining newspaper marketing zones using contiguous clustering

We develop a heuristic procedure for partitioning graphs into clusters of nodes such that each cluster of nodes induces a connected subgraph with the objective of minimizing the differences within clusters as measured by the total differences between all pairs of nodes of a cluster. We apply our procedure to determine optimal delivery zones for community sections of a major newspaper while including a number of operational constraints. Our results demonstrate a 18–56% improvement in the total differences within the zones designed over the usual intuitive heuristics. Given the magnitude of the revenue generated by larger local newspapers through zoning, our method demonstrates how better zoning can significantly enhance the value of segmentation. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Economic ordering decisions with market choice flexibility

Standard approaches to classical inventory control problems treat satisfying a predefined demand level as a constraint. In many practical contexts, however, total demand is comprised of separate demands from different markets or customers. It is not always clear that constraining a producer to satisfy all markets is an optimal approach. Since the inventory‐related cost of an item depends on total demand volume, no clear method exists for determining a market's profitability a priori, based simply on per unit revenue and cost. Moreover, capacity constraints often limit a producer's ability to meet all demands. This paper presents models to address economic ordering decisions when a producer can choose whether to satisfy multiple markets. These models result in a set of nonlinear binary integer programming problems that, in the uncapacitated case, lend themselves to efficient solution due to their special structure. The capacitated versions can be cast as nonlinear knapsack problems, for which we propose a heuristic solution approach that is asymptotically optimal in the number of markets. The models generalize the classical EOQ and EPQ problems and lead to interesting optimization problems with intuitively appealing solution properties and interesting implications for inventory and pricing management. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

The parallel replacement problem with demand and capital budgeting constraints

A generalized parallel replacement problem is considered with both fixed and variable replacement costs, capital budgeting, and demand constraints. The demand constraints specify that a number of assets, which may vary over time, are required each period over a finite horizon. A deterministic, integer programming formulation is presented as replacement decisions must be integer. However, the linear programming relaxation is shown to have integer extreme points if the economies of scale binary variables are fixed. This allows for the efficient computation of large parallel replacement problems as only a limited number of 0–1 variables are required. Examples are presented to provide insight into replacement rules, such as the “no‐splitting‐rule” from previous research, under various demand scenarios. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 40–56, 2000     

Validation of a strategy for harbor defense based on the use of a min‐max algorithm receding horizon control law

We present a validation of a centralized feedback control law for robotic or partially robotic water craft whose task is to defend a harbor from an intruding fleet of water craft. Our work was motivated by the need to provide harbor defenses against hostile, possibly suicidal intruders, preferably using unmanned craft to limit potential casualties. Our feedback control law is a sample‐data receding horizon control law, which requires the solution of a complex max‐min problem at the start of each sample time. In developing this control law, we had to deal with three challenges. The first was to develop a max‐min problem that captures realistically the nature of the defense‐intrusion game. The second was to ensure the solution of this max‐min problem can be accomplished in a small fraction of the sample time that would be needed to control a possibly fast moving craft. The third, to which this article is dedicated, was to validate the effectiveness of our control law first through computer simulations pitting a computer against a computer or a computer against a human, then through the use of model hovercraft in a laboratory, and finally on the Chesapeake Bay, using Yard Patrol boats. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 247–259, 2016